Branch-and-Prune Search Strategies for Numerical Constraint Solving
نویسندگان
چکیده
Xuan-Ha VU, Marius-Călin SILAGHI, Djamila SAM-HAROUD and Boi FALTINGS 1 Cork Constraint Computation Centre, University College Cork (UCC), 14 Washington Street West, Cork, Ireland, Email: [email protected]; 2 Department of Computer Science, Florida Institute of Technology (FIT), 150 West University Boulevard, Melbourne, FL-32901-6975, USA Email: [email protected]; 3 Artificial Intelligence Laboratory, Ecole Polytechniqe Fédéral de Lausanne (EPFL), Batiment IN, Station 14, CH-1015 Lausanne, Switzerland, Email: [email protected], [email protected].
منابع مشابه
Excluding Regions Using Sobol Sequences in an Interval Branch-and-Prune Method for Nonlinear Systems
Traditional rejection/reduction tests used in branch-and-prune methods for nonlinear systems usually are based on various forms of the interval Newton operator and constraint propagation techniques. Hence, they are relatively costly. This paper considers an additional phase of a branchand-prune method for the exclusion of regions not containing any solutions. Low-discrepancy sequences of Sobol ...
متن کاملar X iv : c s / 05 12 04 5 v 2 [ cs . A I ] 8 M ay 2 00 7 Branch - and - Prune Search Strategies for Numerical Constraint Solving
Xuan-Ha VU, Marius-Călin SILAGHI, Djamila SAM-HAROUD and Boi FALTINGS 1 Cork Constraint Computation Centre, University College Cork (UCC), 14 Washington Street West, Cork, Ireland, Email: [email protected]; 2 Department of Computer Science, Florida Institute of Technology (FIT), 150 West University Boulevard, Melbourne, FL-32901-6975, USA Email: [email protected]; 3 Artificial Intelligenc...
متن کاملOpenSolver: A Coordination-Enabled Abstract Branch-and-Prune Tree Search Engine
Coordination programming deals with building complex software systems from largely autonomous component systems. Cooperative constraint solving (see for example [1]), which is widely recognized as a means to improve efficiency of constraint solving, is an area that may benefit from techniques developed in coordination programming, because the solvers that we want to combine are generally autono...
متن کاملExploiting Single-Cycle Symmetries in Branch-and-Prune algorithms
As a first attempt to exploit symmetries in continuous constraint problems, we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a Branch-and-Prune algorithm without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cu...
متن کاملA Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems
This paper discusses the processing of non-linear polynomial systems using a branch and prune algorithm within the framework of constraint programming. We propose a formalism for a kind of branch and prune algorithm implementing symbolic and numerical methods to reduce the systems with respect to a relation de ned from both inclusion of variable domains and inclusion of sets of constraints. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0512045 شماره
صفحات -
تاریخ انتشار 2005